A Hybrid Genetic Scatter Search Algorithm for Solving Optimization Problems

The search methods that have been developed to investigate the optimum point of any optimization problem are suffering from some shortcomings especially that are complex and NP-hard problems. The progress that have been achieved in the filed of information technology leads to developing a new search methods called "intelligent search methods". This paper highlights hybrid genetic scatter search algorithm that replace two steps in scatter search (combination and improvement) with two steps in genetic (crossover and mutation). This algorithm leads to increases the efficiency and exploration of the solution process. The algorithm has been coded in C# and tested by .solving a set of knapsack problems. Index Terms — Scatter search, genetic algorithms, combinatorial optimization, metaheuristics, knapsack problem.